Transfinite Semantics in the Form of Greatest Fixpoint
نویسندگان
چکیده
منابع مشابه
On Greatest Fixpoint Semantics of Logic Programming
The study of fixpoints has long been at the heart of logic programming. However, whereas least fixpoint semantics works well for SLD-refutations (i.e. is sound and complete), there is no satisfactory (i.e. complete) fixpoint semantics for infinite derivations. In this paper, we focus on this problem. Standard approaches in this area consist in concentrating on infinite derivations that can be s...
متن کاملAsmL Semantics in Fixpoint
AsmL is a novel executable specification language based on the theory of Abstract State Machines (ASMs). It represents one of the most powerful practical engines to write and execute ASMs. In this report, we present a proven complete small-step trace-based operational semantics of the main parts of AsmL. Such a semantics provides precise and non ambiguous definitions of AsmL. It is very useful ...
متن کاملFixpoint semantics and simulation
A general functorial framework for recursive deenitions is presented in which simulation of a deenition scheme by another one implies an ordering between the values deened by these schemes in an arbitrary model. Under mild conditions on the functor involved, the converse implication also holds: a model is constructed such that, if the values deened are ordered, there is a simulation between the...
متن کاملTransfinite semantics in program slicing
This paper studies mathematically some special kinds of transfinite trace semantics and investigates program slicing w.r.t. these semantics. Several general facts about slicing, which hold for a wide class of programming languages and their transfinite semantics, are proven. The principal part of the work is done on control flow graphs keeping the treatment abstracted from any concrete programm...
متن کاملLeast Fixpoint and Greatest Fixpoint in a Process Algebra with Conjunction and Disjunction
We have already proposed a process algebra μLOTOS as a mathematical framework to synthesize a process from a number of (incomplete) specifications, in which requirements for the process do not have to be completely determined. It is guaranteed that the synthesized process satisfies all the given specifications, if they are consistent. For example, μLOTOS is useful for incremental design. The ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2009
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2009.03.001